Applying k-vertex cardinality constraints on a Neo4j graph database

As with any other database solution, graph databases also need to be able implement business rules related a given application domain. At the moment, aside from integrity constraints, there is limited number of mechanisms for implementation in Graph Database Management Systems (GDBMSs). The underlying property data model does not include formal notation on how represent different constraints. Specifically, this paper discusses problem representing cardinality constraints databases. We introduce novel concept k -vertex which enable us specify minimum and maximum edges between vertex subgraph. propose an approach, includes representation through model, demonstrate its series stored procedures Neo4j GDBMS. proposed approach then evaluated by performing experiments synthetic real datasets test influence checking query execution times (QETs) when adding new edges. Additionally, comparison performed varying outgoing degrees order gain insight into increasing degree affects QETs. In general, results obtained each scenario show that implemented significantly affect Also, indicate dependent dataset. • Cardinality limit vertices. specification higher checked during creating and/or existing data. shows 10–170ms overhead times.